On the Unimodality of Domination Polynomials
نویسندگان
چکیده
A polynomial is said to be unimodal if its coefficients are non-decreasing and then non-increasing. The domination of a graph G the generating function number dominating sets each cardinality in G, have been conjectured unimodal. In this paper we will show paths, cycles complete multipartite graphs unimodal, that almost every with mode $$ \lceil \frac{n}{2}\rceil .
منابع مشابه
On the domination polynomials of non P4-free graphs
A graph $G$ is called $P_4$-free, if $G$ does not contain an induced subgraph $P_4$. The domination polynomial of a graph $G$ of order $n$ is the polynomial $D(G,x)=sum_{i=1}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$. Every root of $D(G,x)$ is called a domination root of $G$. In this paper we state and prove formula for the domination polynomial of no...
متن کاملPartial unimodality properties of independence polynomials
A stable set in a graph G is a set of pairwise non-adjacent vertices and α(G) is the size of a maximum stable set in the graph G. The polynomial I(G; x) = s0 + s1x + s2x + ... + sαx, α = α(G), is called the independence polynomial of G (Gutman and Harary, 1983), where sk is the number of stable sets of cardinality k in G. I(G; x) is partial unimodal if the sequence of its coefficients (sk) is p...
متن کاملOn Unimodality of Independence Polynomials of Some Well-Covered Trees
The stability number α(G) of the graph G is the size of a maximum stable set of G. If sk denotes the number of stable sets of cardinality k in graph G, then I(G;x) = α(G)
متن کاملUnimodality and Log-Concavity of Polynomials
A polynomial is unimodal if its sequence of coefficients are increasing up to an index, and then are decreasing after that index. A polynomial is logconcave if the sequence of the logarithms of the coefficients is concave. We prove that if P (x) is a polynomial with nonnegative non-decreasing coefficients then P (x+z) is unimodal for any natural z. Furthermore, we prove that if P (x) is a log-c...
متن کاملActions on permutations and unimodality of descent polynomials
We study a group action on permutations due to Foata and Strehl and use it to prove that the descent generating polynomial of certain sets of permutations has a nonnegative expansion in the basis {t(1 + t)} i=0 , m = ⌊(n−1)/2⌋. This property implies symmetry and unimodality. We prove that the action is invariant under stack-sorting which strengthens recent unimodality results of Bóna. We prove ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2022
ISSN: ['1435-5914', '0911-0119']
DOI: https://doi.org/10.1007/s00373-022-02487-x